Packing measures and dimensions on cartesian products
نویسندگان
چکیده
منابع مشابه
Packing Measures and Dimensions on Cartesian Products
Packing measures Pg(E) and Hewitt-Stromberg measures νg(E) and their relatives are investigated. It is shown, for instance, that for any metric spaces X, Y and any Hausdorff functions f , g ν(X) ·P(Y ) 6 P(X × Y ). The inequality for the corresponding dimensions is established and used for a solution of a problem of Hu and Taylor: If X ⊆ Rn, then inf{dimPX × Y − dimPY : Y ⊆ R} = lim inf Xn↗X di...
متن کاملPacking and Domination Invariants on Cartesian Products and Direct Products
The dual notions of domination and packing in finite simple graphs were first extensively explored by Meir and Moon in [15]. Most of the lower bounds for the domination number of a nontrivial Cartesian product involve the 2-packing, or closed neighborhood packing, number of the factors. In addition, the domination number of any graph is at least as large as its 2-packing number, and the invaria...
متن کاملOn the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several lower and upper bounds are obtained for the packing chromatic number of Cartesian products of graphs. It is proved that the packing chromatic number of the infinite hexagonal lattice lies between 6 and 8. Optimal lower a...
متن کاملGeneralized Shifts on Cartesian Products
It is proved that if E, F are infinite dimensional strictly convex Banach spaces totally incomparable in a restricted sense, then the Cartesian product E × F with the sum or sup norm does not admit a forward shift. As a corollary it is deduced that there are no backward or forward shifts on the Cartesian product `p1 × `p2 , 1 < p1 6= p2 < ∞, with the supremum norm thus settling a problem left o...
متن کاملLIGHTS OUT! on Cartesian Products
The game LIGHTS OUT! is played on a 5× 5 square grid of buttons; each button may be on or off. Pressing a button changes the on/off state of the light of the button pressed and of all its vertical and horizontal neighbors. Given an initial configuration of buttons that are on, the object of the game is to turn all the lights out. The game can be generalized to arbitrary graphs. In this paper, C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicacions Matemàtiques
سال: 2013
ISSN: 0214-1493
DOI: 10.5565/publmat_57213_06